Polynomial decomposition

Results: 68



#Item
21Matroid theory / Polynomials / Tutte polynomial / Degree / Tree / NP-complete problems / Path decomposition / Handshaking lemma / Graph theory / Mathematics / Theoretical computer science

A Constant Bound for the Periods of Parallel Chip-firing Games with Many Chips Paul Myer Kominers and Scott Duke Kominers Abstract. We prove that any parallel chip-firing game on a graph G with at least 4|E(G)| − |V (G

Add to Reading List

Source URL: www.pkoms.com

Language: English - Date: 2011-12-29 23:15:14
22Graph / Matching / Bipartite graph / Independent set / Matroid theory / Tutte polynomial / Path decomposition / Graph theory / Mathematics / NP-complete problems

BRICS Basic Research in Computer Science BRICS RSHangos et al.: Some Complexity Problems on Single Input Double Output Controllers Some Complexity Problems on

Add to Reading List

Source URL: www.brics.dk

Language: English - Date: 2001-05-28 05:33:34
23P / Mathematics / Cylindrical algebraic decomposition / Complexity classes / NP / Polynomial

An  Improved  Algorithm  for     Computing  Roadmaps  of  Algebraic  Sets   Saugata  Basu   Purdue  University    

Add to Reading List

Source URL: iros2011.org

Language: English - Date: 2011-09-21 06:59:57
24Algebraic structures / Modular arithmetic / Commutative algebra / Polynomial ring / Polynomials / Ring theory / Ideal / Algebraic geometry / Congruence relation / Abstract algebra / Algebra / Mathematics

COMBINATORICS OF BINOMIAL PRIMARY DECOMPOSITION ALICIA DICKENSTEIN, LAURA FELICIA MATUSEVICH, AND EZRA MILLER A BSTRACT. An explicit lattice point realization is provided for the primary components of an arbitrary binomi

Add to Reading List

Source URL: www.math.duke.edu

Language: English - Date: 2008-05-25 20:03:48
25P / Mathematics / Cylindrical algebraic decomposition / Complexity classes / NP / Polynomial

An  Improved  Algorithm  for     Computing  Roadmaps  of  Algebraic  Sets   Saugata  Basu   Purdue  University    

Add to Reading List

Source URL: www.cse.unr.edu

Language: English - Date: 2012-12-20 19:29:22
26Matrix theory / Matrices / Abstract algebra / Singular value decomposition / Eigenvalues and eigenvectors / Symmetric matrix / Matrix / Orthogonal matrix / Vector space / Algebra / Linear algebra / Mathematics

Some Basic Matrix Theorems Richard E. Quandt Princeton University Definition 1. Let A be a square matrix of order n and let λ be a scalar quantity. Then det(A−λI) is called the characteristic polynomial of A.

Add to Reading List

Source URL: www.quandt.com

Language: English - Date: 2009-11-04 11:37:58
27Abstract algebra / Minimal polynomial / Irreducible polynomial / Factorization of polynomials / Finite field / Frobenius normal form / Factorization of polynomials over a finite field and irreducibility tests / Algebra / Mathematics / Polynomials

Decomposition of Additive Cellular Automata

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:36:39
28Numerical analysis / Partial differential equations / Stochastic processes / Differential equations / Computational science / Polynomial chaos / Spectral method / Monte Carlo method / Galerkin method / Calculus / Mathematics / Mathematical analysis

Generalized Polynomial Chaos Decomposition for the Stokes Equations with stochastic inputs

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2013-01-16 21:25:32
29Matrix theory / Linear algebra / Representation theory of Lie groups / Eigenvalues and eigenvectors / Singular value decomposition / Weight / Spectrum / Sturm–Liouville theory / Spectral theory of ordinary differential equations / Algebra / Mathematics / Spectral theory

Computation of a Class of Continued Fraction Constants Lo¨ıck Lhote∗ Abstract We describe a class of algorithms which compute in polynomial– time important constants related to the Euclidean Dynamical System. Our a

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2005-07-06 08:18:47
30Automated planning and scheduling / Pebble motion problems / Tree decomposition / Algorithm / Graph pebbling / Graph coloring / Graph theory / Mathematics / Theoretical computer science

Pebbles in Motion Polynomial Algorithms for Multi-Agent Path Planning Problems Supervisor: Author:

Add to Reading List

Source URL: ai.cs.unibas.ch

Language: English - Date: 2013-01-07 17:29:29
UPDATE